A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
نویسندگان
چکیده
منابع مشابه
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints a Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing 25], sequencing in exible...
متن کاملA Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Symmetri Generalized Travelling Salesman Problem Matteo Fis hetti Juan Jos e Salazar Gonz alezy Paolo Tothz January 1994; Revised May 1995 Abstra t We onsider a variant of the lassi al symmetri Travelling Salesman Problem in whi h the nodes are partitioned into lusters and the salesman has to visit at least one node for ea h luster. This NP-hard problem is known in the literature as the symmetr...
متن کاملA branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be picked up, and a destination location where the load must be delivered. The problem consists of determining a shortest Hamiltonian cycle through all locations while ensuring that the pickup of each request is performed...
متن کاملA branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
This paper studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint which states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch-and-...
متن کاملA Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2020.04.024